Screening Tests for Lasso Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Screening Tests for LASSO

This paper focusses on “safe” screening techniques for the LASSO problem. Motivated by the need for low-complexity algorithms, we propose a new approach, dubbed “joint screening test”, allowing to screen a set of atoms by carrying out one single test. The approach is particularized to two different sets of atoms, respectively expressed as sphere and dome regions. After presenting the mathematic...

متن کامل

Screening Rules for Overlapping Group Lasso

Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because the overlaps between groups make it infeasible to test each group independen...

متن کامل

SVD-Based Screening for the Graphical Lasso

The graphical lasso is the most popular approach to estimating the inverse covariance matrix of highdimension data. It iteratively estimates each row and column of the matrix in a round-robin style until convergence. However, the graphical lasso is infeasible due to its high computation cost for large size of datasets. This paper proposes Sting, a fast approach to the graphical lasso. In order ...

متن کامل

Review of Autism Screening Tests

Background: Autism is a neurodevelopmental disorder that onset in the first 3 years of life and led to lifelong disability.Despite the early onset of symptoms, diagnosis of thissyndromedoes not happenuntil severalyears later, somany childrenlosethe opportunityfor earlyintervention.There arevarious toolsforscreening anddiagnosis, buttheirdesign, strengths and weaknesses aredifferent. The aim of ...

متن کامل

Feedback-Controlled Sequential Lasso Screening

One way to solve lasso problems when the dictionary does not fit into available memory is to first screen the dictionary to remove unneeded features. Prior research has shown that sequential screening methods offer the greatest promise in this endeavor. Most existing work on sequential screening targets the context of tuning parameter selection, where one screens and solves a sequence of N lass...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence

سال: 2017

ISSN: 0162-8828,2160-9292

DOI: 10.1109/tpami.2016.2568185